A Higher-Order Iterative Path Ordering
نویسندگان
چکیده
The higher-order recursive path ordering (HORPO) defined by Jouannaud and Rubio provides a method to prove termination of higher-order rewriting. We present an iterative version of HORPO by means of an auxiliary term rewriting system, following an approach originally due to Bergstra and Klop. We study well-foundedness of the iterative definition, discuss its relationship with the original HORPO, and point out possible ways to strengthen the ordering.
منابع مشابه
(HO)RPO Revisited
The notion of computability closure has been introduced for proving the termination of the combination of higher-order rewriting and beta-reduction. It is also used for strengthening the higher-order recursive path ordering. In the present paper, we study in more details the relations between the computability closure and the (higher-order) recursive path ordering. We show that the first-order ...
متن کاملA Termination Ordering for Higher Order Rewrite System
We present an extension of the recursive path ordering for the purpose of showing termination of higher order rewrite systems. Keeping close to the general path ordering of Dershowitz and Hoot, we demonstrate the necessary properties of the termination functions for our method to apply, thus describe a class of diierent orderings. We also give a counterexample to a previously published extensio...
متن کاملA Termination Ordering for Higher Order Rewrite Systems
We present an extension of the recursive path ordering for the purpose of showing termination of higher order rewrite systems. Keeping close to the general path ordering of Dershowitz and Hoot, we demonstrate su cient properties of the termination functions for our method to apply. Thereby we describe a class of di erent orderings. Finally we compare our method to previously published extension...
متن کاملAn Lpo-based Termination Ordering for Higher-order Terms without -abstraction
We present a new precedence-based termination ordering for (polymorphic) higher-order terms without-abstraction. The ordering has been designed to strictly generalize the lexicographic path ordering (on rst-order terms). It is relatively simple, but can be used to prove termination of many higher-order rewrite systems, especially those corresponding to typical functional programs. We establish ...
متن کاملIterative Lexicographic Path Orders
We relate Kamin and Lévy’s original presentation of lexicographic path orders (LPO), using an inductive definition, to a presentation, which we will refer to as iterative lexicographic path orders (ILPO), based on Bergstra and Klop’s definition of recursive path orders by way of an auxiliary term rewriting sytem. Dedicated to Joseph Goguen, in celebration of his 65th birthday.
متن کامل